More existence theorems for recursion categories

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Locally Connected Recursion Categories

A recursion category is locally connected if connected domains are jointly epimorphic. New proofs of the existence of non-complemented and recursively inseparable domains are given in a locally connected category. The use of local connectedness to produce categorical analogs of undecidable problems is new; the approach allows us to relax the hypotheses under which the results were originally pr...

متن کامل

Independence Results for n-Ary Recursion Theorems

The n-ary first and second recursion theorems formalize two distinct, yet similar, notions of self-reference. Roughly, the n-ary first recursion theorem says that, for any n algorithmic tasks (of an appropriate type), there exist n partial computable functions that use their own graphs in the manner prescribed by those tasks; the n-ary second recursion theorem says that, for any n algorithmic t...

متن کامل

Existence Theorems for Warfield Groups

Warfield studied p-local groups that are summands of simply presented groups, introducing invariants that, together with Ulm invariants, determine these groups up to isomorphism. In this paper, necessary and sufficient conditions are given for the existence of a Warfield group with prescribed Ulm and Warfield invariants. It is shown that every Warfield group is the direct sum of a simply presen...

متن کامل

TR-2006011: Locally Connected Recursion Categories

A recursion category is locally connected if connected domains are jointly epimorphic. New proofs of the existence of non-complemented and recursively inseparable domains are given in a locally connected category. The use of local connectedness to produce categorical analogs of undecidable problems is new; the approach allows us to relax the hypotheses under which the results were originally pr...

متن کامل

Join inverse categories and reversible recursion

Recently, a number of reversible functional programming languages have been proposed. Common to several of these is the assumption of totality, a property that is not necessarily desirable, and certainly not required in order to guarantee reversibility. In a categorical setting, however, faithfully capturing partiality requires handling it as additional structure. Recently, Giles studied invers...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 2004

ISSN: 0168-0072

DOI: 10.1016/s0168-0072(03)00060-5